منابع مشابه
Efficient reconstruction of partitions
We consider the problem of reconstructing a partition x of the integer n from the set of its tsubpartitions. These are the partitions of the integer n − t obtained by deleting a total of t from the parts of x in all possible ways. It was shown (in a forthcoming paper) that all partitions of n can be reconstructed from t-subpartitions if n is sufficiently large in relation to t. In this paper we...
متن کاملReconstruction of Partitions
For the partition x = [x1 ≥ x2 ≥ · · · ≥ xk] of the integer n = ∑ i xi a t-deletion is a partition y = [y1 ≥ y2 ≥ · · · ≥ yk] with xi ≥ yi ≥ 0 and ∑ i (xi−yi) = t. We prove that all partitions of n are reconstructible from their t–deletions if n is sufficiently large in relation to t.
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملA Sharp Bound for the Reconstruction of Partitions
Analogues and variations of Ulam’s notorious graph reconstruction conjecture have been studied for a variety of combinatorial objects, for instance words (see Schützenberger and Simon [2, Theorem 6.2.16]), permutations (see Raykova [4] and Smith [5]), and compositions (see Vatter [6]), to name a few. In answer to Cameron’s query [1] about the partition context, Pretzel and Siemons [3] proved th...
متن کاملPartitions for Spectral (Finite) Volume Reconstruction in the Tetrahedron
In this paper, we compute partitions of the tetrahedron for up to the fourth-order spectral volume reconstruction. Certain optimization is made to these partitions and previously obtained partitions of lower dimensional simplex. These optimized partitions have the smallest Lebesgue constants among currently known spectral volume partitions. Institute for Mathematics and its Applications, Univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1892